Spatially adaptive sparse grids for high-dimensional data-driven problems
نویسندگان
چکیده
منابع مشابه
Spatially Adaptive Sparse Grids for High-Dimensional Problems
Disclaimer: This pdf version differs slightly from the printed version. Few typos have been corrected! Acknowledgments This thesis would not have been possible without the direct and indirect contributions of several colleagues and friends to which I owe my greatest gratitude. Foremost, I am heartily thankful to my supervisor Hans-Joachim Bungartz for " panem et circenses " , enabling me to wor...
متن کاملEfficient Regression for Big Data Problems using Adaptive Sparse Grids
The amount of available data increases rapidly. This trend, often related to as Big Data challenges modern data mining algorithms, requiring new methods that can cope with very large, multi-variate regression problems. A promising approach that can tackle non-linear, higher-dimensional problems is regression using sparse grids. Sparse grids use a multiscale system of grids with basis functions ...
متن کاملUsing Adaptive Sparse Grids to Solve High-Dimensional Dynamic Models∗
We present a flexible and scalable method to compute global solutions of high-dimensional non-smooth dynamic models. Within a timeiteration setup, we interpolate policy functions using an adaptive sparse grid algorithm with piecewise multi-linear (hierarchical) basis functions. As the dimensionality increases, sparse grids grow considerably slower than standard tensor product grids. In addition...
متن کاملCharacterization of discontinuities in high-dimensional stochastic problems on adaptive sparse grids
In this paper we present a set of efficient algorithms for detection and identification of discontinuities in high dimensional space. The method is based on extension of polynomial annihilation for discontinuity detection in low dimensions. Compared to the earlier work, the present method poses significant improvements for high dimensional problems. The core of the algorithms relies on adaptive...
متن کاملHigh dimensional polynomial interpolation on sparse grids
We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2010
ISSN: 0885-064X
DOI: 10.1016/j.jco.2010.04.001